Approximation theory - PDFSEARCH.IO - Document Search Engine

Approximation theory
Results: 831

#	Item
361	A Polynomial Time Approximation Scheme for k-Consensus Clustering∗ Tom Coleman† Abstract This paper introduces a polynomial time approximation scheme for the metric Correlation Clustering problem, when the number of Add to Reading List Source URL: tom.thesnail.org Language: English - Date: 2015-05-04 03:09:24 Approximation algorithms Cluster analysis Combinatorial optimization NP-complete problems Complexity classes Correlation clustering Consensus clustering Optimization problem Minimum k-cut Theoretical computer science Computational complexity theory Statistics
362	A Linear Kernel for the Complementary Maximal Strip Recovery Problem Binhai Zhu Computer Science Department Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2012-12-29 15:19:34 Analysis of algorithms Parameterized complexity NP-complete problems Kernelization Time complexity Vertex cover Algorithm Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
363	Quick Polytope Approximation of All Correlated Equilibria in Stochastic Games Liam MacDermed, Karthik S. Narayan, Charles L. Isbell, Lora Weiss Georgia Institute of Technology Robotics and Intelligent Machines Laboratory Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-03-28 21:02:33 Polytopes Control theory Decision theory Mathematical economics Convex geometry Mathematical optimization Markov decision process Linear programming Game theory Operations research Geometry Mathematics
364	CUR from a Sparse Optimization Viewpoint Jacob Bien∗ Department of Statistics Stanford University Stanford, CA 94305 Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2010-10-28 23:49:43 Numerical linear algebra Mathematical optimization Multivariate statistics Matrix theory Principal component analysis Sparse approximation Sparse matrix Singular value decomposition Matrix Algebra Mathematics Linear algebra
365	Efficient Rank-one Residue Approximation Method for Graph Regularized Non-negative Matrix Factorization Qing Liao, Qian Zhang Department of Computer Science and Engineering The Hong Kong University of Science and Technol Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2014-01-05 09:06:34 Matrix theory Multivariate statistics Non-negative matrix factorization Singular value decomposition Singular value Matrix Algebra Linear algebra Mathematics
366	Regularized Laplacian Estimation and Fast Eigenvector Approximation Patrick O. Perry Information, Operations, and Management Sciences NYU Stern School of Business Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2012-08-14 01:08:22 Linear algebra Matrix theory Differential operators Algebraic graph theory Laplacian matrix matrices Laplace operator Eigenvalues and eigenvectors Tikhonov regularization Algebra Mathematics Mathematical analysis
367	Greedy Construction of 2-Approximation Minimum Manhattan Network ⋆ Zeyu Guo1 , He Sun1 , Hong Zhu2 1 2 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2008-09-12 04:58:48 Operations research Optimal control Systems engineering Systems theory Mathematics Systems science Dynamic programming Equations Mathematical optimization
368	S PARSITY BASED R EGULARIZATION Francesca Odone and Lorenzo Rosasco RegML 2014 Regularization Methods for High Dimensional Learning Add to Reading List Source URL: lcsl.mit.edu Language: English - Date: 2014-07-02 13:40:18 Machine learning Regularization Mathematics Sparse approximation Analysis Dimensional regularization Quantum field theory Summability methods Mathematical analysis
369	Édouard Bonnet Paris Dauphine - LAMSADE Computer Science Department Place du Maréchal de Lattre de TassignyParis Add to Reading List Source URL: www.lamsade.dauphine.fr Language: English - Date: 2015-04-20 04:47:40 Parameterized complexity Time complexity Approximation algorithm Vangelis Complexity Set cover problem Cut Theoretical computer science Computational complexity theory Applied mathematics
370	Budget Feasible Mechanisms for Experimental Design Thibaut Horel ´ Ecole Normale Sup´erieure Add to Reading List Source URL: thibaut.horel.org Language: English - Date: 2015-01-22 00:44:30 Approximation algorithms Submodular set function Time complexity Linear programming relaxation Polynomial-time approximation scheme Linear programming Randomized rounding Normal distribution Linear regression Theoretical computer science Applied mathematics Computational complexity theory

UPDATE